f(c(s(x), y)) → f(c(x, s(y)))
g(c(x, s(y))) → g(c(s(x), y))
g(s(f(x))) → g(f(x))
↳ QTRS
↳ DependencyPairsProof
f(c(s(x), y)) → f(c(x, s(y)))
g(c(x, s(y))) → g(c(s(x), y))
g(s(f(x))) → g(f(x))
F(c(s(x), y)) → F(c(x, s(y)))
G(s(f(x))) → G(f(x))
G(c(x, s(y))) → G(c(s(x), y))
f(c(s(x), y)) → f(c(x, s(y)))
g(c(x, s(y))) → g(c(s(x), y))
g(s(f(x))) → g(f(x))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
F(c(s(x), y)) → F(c(x, s(y)))
G(s(f(x))) → G(f(x))
G(c(x, s(y))) → G(c(s(x), y))
f(c(s(x), y)) → f(c(x, s(y)))
g(c(x, s(y))) → g(c(s(x), y))
g(s(f(x))) → g(f(x))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
G(c(x, s(y))) → G(c(s(x), y))
f(c(s(x), y)) → f(c(x, s(y)))
g(c(x, s(y))) → g(c(s(x), y))
g(s(f(x))) → g(f(x))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
G(c(x, s(y))) → G(c(s(x), y))
The value of delta used in the strict ordering is 8.
POL(c(x1, x2)) = x_2
POL(G(x1)) = (2)x_1
POL(s(x1)) = 4 + (4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
f(c(s(x), y)) → f(c(x, s(y)))
g(c(x, s(y))) → g(c(s(x), y))
g(s(f(x))) → g(f(x))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
F(c(s(x), y)) → F(c(x, s(y)))
f(c(s(x), y)) → f(c(x, s(y)))
g(c(x, s(y))) → g(c(s(x), y))
g(s(f(x))) → g(f(x))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(c(s(x), y)) → F(c(x, s(y)))
The value of delta used in the strict ordering is 16.
POL(c(x1, x2)) = (2)x_1
POL(s(x1)) = 4 + (4)x_1
POL(F(x1)) = (2)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
f(c(s(x), y)) → f(c(x, s(y)))
g(c(x, s(y))) → g(c(s(x), y))
g(s(f(x))) → g(f(x))